On the complexity of fixed parameter clique and dominating set
نویسندگان
چکیده
We provide simple, faster algorithms for the detection of cliques and dominating sets of fixed order. Our algorithms are based on reductions to rectangular matrix multiplication. We also describe an improved algorithm for diamonds detection.
منابع مشابه
Parameterized Complexity of Neighborhood Problems in Graphs with no Small Cycles
We show that several problems that are hard for various parameterized complexity classes on general graphs, become fixed parameter tractable on graphs with no small cycles. More specifically, we give fixed parameter algorithms for Dominating Set, t-Vertex Cover (where we need to cover at least t edges) and several of their variants on graphs that have no triangles or cycles of length 4. These p...
متن کاملClique-width: on the price of generality
Many hard problems can be solved efficiently when the input is restricted to graphs of bounded treewidth. By the celebrated result of Courcelle, every decision problem expressible in monadic second order logic is fixed parameter tractable when parameterized by the treewidth of the input graph. Moreover, for every fixed k ≥ 0, such problems can be solved in linear time on graphs of treewidth at ...
متن کاملIntractability of Clique-Width Parameterizations
We show that Edge Dominating Set, Hamiltonian Cycle, and Graph Coloring are W [1]-hard parameterized by clique-width. It was an open problem, explicitly mentioned in several papers, whether any of these problems is fixed parameter tractable when parameterized by the clique-width, that is, solvable in time g(k) · nO(1) on n-vertex graphs of clique-width k, where g is some function of k only. Our...
متن کاملOn the Fixed-Parameter Intractability and Tractability of Multiple-Interval Graph Problems
Multiple-interval graphs are a natural generalization of interval graphs where each vertex may have more then one interval associated with it. Many applications of interval graphs also generalize to multiple-interval graphs, often allowing for better robustness in the modeling of the specific application. In this paper, we study the fixed-parameter tractability and intractability of three class...
متن کاملAlgorithmic Lower Bounds for Problems Parameterized with Clique-Width
Many NP-hard problems can be solved efficiently when the input is restricted to graphs of bounded tree-width or cliquewidth. In particular, by the celebrated result of Courcelle, every decision problem expressible in monadic second order logic is fixed parameter tractable when parameterized by the tree-width of the input graph. On the other hand if we restrict ourselves to graphs of clique-widt...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Theor. Comput. Sci.
دوره 326 شماره
صفحات -
تاریخ انتشار 2004